翻訳と辞書 Words near each other ・ Multi-subject instructional period ・ Multi-surface method ・ Multi-swarm optimization ・ Multi-system (rail) ・ Multi-tap ・ Multi-task learning ・ Multi-tendency ・ Multi-Terrain Pattern ・ Multi-threshold CMOS ・ Multi-tool ・ Multi-tool (powertool) ・ Multi-touch ・ Multi-Touch Collaboration Wall ・ Multi-touch, physics and gestures ・ Multi-track ・ Multi-track Turing machine ・ Multi-trials technique ・ Multi-Use Games Area ・ Multi-Use Radio Service ・ Multi-Use Simulation Models ・ Multi-user ・ Multi-user BASIC ・ Multi-user MIMO ・ Multi-utility ・ Multi-valve ・ Multi-vari chart ・ Multi-Vendor Integration Protocol ・ Multi-wavelength anomalous dispersion ・ Multi-wire saw ・ Multi-word verb Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Multi-track Turing machine ： ウィキペディア英語版 Multi-track Turing machine A Multitrack Turing machine is a specific type of Multi-tape Turing machine. In a standard n-tape Turing machine, n heads move independently along n tracks. In a n-track Turing machine, one head reads and writes on all tracks simultaneously. A tape position in a n-track Turing Machine contains n symbols from the tape alphabet. It is equivalent to the standard Turing machine and therefore accepts precisely the recursively enumerable languages. == Formal definition == A multitape Turing machine can be formally defined as a 6-tuple $M=\; \backslash langle\; Q,\; \backslash Sigma,\; \backslash Gamma,\; \backslash delta,\; q\_0,\; F\; \backslash rangle$, where * $Q$ is a finite set of states * $\backslash Sigma$ is a finite set of symbols called the ''tape alphabet'' *$\backslash Gamma\; \backslash in\; Q$ * $q\_0\; \backslash in\; Q$ is the ''initial state'' * $F\; \backslash subseteq\; Q$ is the set of ''final'' or ''accepting states''. *$\backslash delta\; \backslash subseteq\; \backslash left(Q\; \backslash backslash\; F\; \backslash times\; \backslash Sigma\backslash right)\; \backslash times\; \backslash left(\; Q\; \backslash times\; \backslash Sigma\; \backslash times\; d\; \backslash right)$ is a relation on states and symbols called the ''transition relation''. *$\backslash delta\; \backslash left(Q\_i,()\backslash right)=(Q\_j,(),d)$ where $d\; \backslash in\; \backslash$ 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Multi-track Turing machine」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.